A Proximal Algorithm for Total Variation-Based Phase Retrieval

نویسنده

  • Anqi Fu
چکیده

In this paper, I study the problem of phase retrieval with total variation (TV) smoothing and denoising. I construct an optimization model with an anisotropic TV penalty term, then show how to solve it using a proximal gradient method. This iterative-shrinkage-thresholding phase retrieval algorithm (ISTPRA) combines fixed-point iterations with a fast gradient solver for the convex subproblem. I compare my algorithm’s performance to several alternating projection methods. My results show that ISTPRA achieves a lower reconstruction error, while remaining robust to noise.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Modified Grasshopper Optimization Algorithm Combined with CNN for Content Based Image Retrieval

Nowadays, with huge progress in digital imaging, new image processing methods are needed to manage digital images stored on disks. Image retrieval has been one of the most challengeable fields in digital image processing which means searching in a big database in order to represent similar images to the query image. Although many efficient researches have been performed for this topic so far, t...

متن کامل

A Field Guide to Forward-Backward Splitting with a FASTA Implementation

Non-differentiable and constrained optimization play a key role in machine learning, signal and image processing, communications, and beyond. For highdimensional minimization problems involving large datasets or many unknowns, the forward-backward splitting method (also known as the proximal gradient method) provides a simple, yet practical solver. Despite its apparent simplicity, the performan...

متن کامل

Chaotic Genetic Algorithm based on Explicit Memory with a new Strategy for Updating and Retrieval of Memory in Dynamic Environments

Many of the problems considered in optimization and learning assume that solutions exist in a dynamic. Hence, algorithms are required that dynamically adapt with the problem’s conditions and search new conditions. Mostly, utilization of information from the past allows to quickly adapting changes after. This is the idea underlining the use of memory in this field, what involves key design issue...

متن کامل

Image Retrieval Using Dynamic Weighting of Compressed High Level Features Framework with LER Matrix

In this article, a fabulous method for database retrieval is proposed.  The multi-resolution modified wavelet transform for each of image is computed and the standard deviation and average are utilized as the textural features. Then, the proposed modified bit-based color histogram and edge detectors were utilized to define the high level features. A feedback-based dynamic weighting of shap...

متن کامل

Somaclonal Variation Among Somatic-Embryo Derived Plants of Olea europaea L “cv. Kroneiki”

Frequency of somaclonal variation in embryogenic calli and plants of Olea europaea L cv.Kroneiki derived from somatic embryogenesis were examined by randomly amplified polymorphic DNA (RAPD) analysis. Radicle and cotyledon (proximal part) of mature zygotic embryo were cultured in OMc medium supplemented with IBA (5 mgL-1) and 2-ip (0.5 mgL-1). Somatic embryogenesis was induced in calli of radic...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016